Broadcasting in dynamic radio networks

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Broadcasting in dynamic radio networks

Article history: Received 25 March 2008 Received in revised form 25 March 2008 Available online 14 December 2008

متن کامل

Broadcasting in Noisy Radio Networks

The widely-studied radio network model [Chlamtac and Kutten, 1985] is a graph-based description that captures the inherent impact of collisions in wireless communication. In this model, the strong assumption is made that node v receives a message from a neighbor if and only if exactly one of its neighbors broadcasts. We relax this assumption by introducing a new noisy radio network model in whi...

متن کامل

Broadcasting in Geometric Radio Networks

We consider deterministic broadcasting in geometric radio networks (GRN) whose nodes know only a limited part of the network. Nodes of a GRN are situated in the plane and each of them is equipped with a transmitter of some range r . A signal from this node can reach all nodes at distance at most r from it but if a node u is situated within the range of two nodes transmitting simultaneously, the...

متن کامل

Fault-Tolerant Broadcasting in Radio Networks

We consider broadcasting in radio networks that are subject to permanent node failures of unknown location. Nodes are spread in a region in some regular way. We consider two cases: nodes are either situated at integer points of a line or they are situated on the plane, at grid points of a square or hexagonal mesh. Nodes send messages in synchronous time-slots. Each node v has a given transmissi...

متن کامل

Faster broadcasting in unknown radio networks

We study the time of distributed deterministic broadcasting in synchronous radio networks of unknown topology and size. If a node u can be reached from two nodes which send messages in the same round, none of the messages is received by u. We assume that nodes are completely ignorant of the network: they know neither its topology, nor size, nor even their immediate neighborhood. The initial kno...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computer and System Sciences

سال: 2009

ISSN: 0022-0000

DOI: 10.1016/j.jcss.2008.10.004